Corrigendum to "Benders Decomposition for multi-stage stochastic mixed complementarity problems - Applied to a global natural gas market model" [Eur. J. Oper. Res. 226(2013) 341-353]
نویسنده
چکیده
The author regrets that some terms are missing or misspecified in the Karush–Kuhn–Tucker conditions in Sections 3.7–3.10 on page 346. Corrections are given below. add multiplier p m c m (discount rate in tree node m multiplied by the probability of its occurrence) to d d (number of days in demand season d).
منابع مشابه
Benders Decomposition Algorithm for Competitive Supply Chain Network Design under Risk of Disruption and Uncertainty
In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...
متن کاملOne-and-two-level Natural Gas Equilibrium Models and Algorithms
Title of Document: ONE-AND-TWO-LEVEL NATURAL GAS EQUILIBRIUM MODELS AND ALGORITHMS Seksun Moryadee Civil Systems Program Department of Civil & Environmental Engineering University of Maryland, College Park, MD USA Directed By: Professor Steven A. Gabriel Department of Civil and Environmental Engineering/Applied Mathematics, Statistics, and Scientific Computation Program This dissertation consis...
متن کاملScenario-based modeling for multiple allocation hub location problem under disruption risk: multiple cuts Benders decomposition approach
The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...
متن کاملDual decomposition in stochastic integer programming
We present an algorithm for solving stochastic integer programming problems with recourse, based on a dual decomposition scheme and La-grangian relaxation. The approach can be applied to multi-stage problems with mixed-integer variables in each time stage. Numerical experience is presented for some two-stage test problems.
متن کاملDecomposition Algorithms for Global Solution of Deterministic and Stochastic Pooling Problems in Natural Gas Value Chains
In this thesis, a Benders decomposition algorithm is designed and implemented to solve both deterministic and stochastic pooling problems to global optimality. Convergence of the algorithm to a global optimum is proved and then it is implemented both in GAMS and C++ to get the best performance. A series of example problems are solved, both with the proposed Benders decomposition algorithm and c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 239 شماره
صفحات -
تاریخ انتشار 2014